Weak Leader Election in the receive-omission failure model
نویسندگان
چکیده
ions that enables one to more expressively represent failure scenarios by considering failures that are not independent or not identically distributed; 4) although it allows for faulty processes to be elected, correct processes are able to detect it, enabling the use of alarms to indicate failures in the system. Relating to our discussion on Primary-Backup protocols, by assuming that faulty processes can be elected, we cannot bound response time for a Primary-Backup algorithm. We can guarantee, however, that there is at most one primary at any time, and that response is bounded whenever a correct process emerges as the primary. We further discuss this and other issues with Primary-Backup protocols later in the paper.
منابع مشابه
Designing and Evaluating Fault-tolerant Leader Election Algorithms
Fault-tolerant leader election is a basic building block for dependable distributed computing, since it allows coordinating decisions among replicas such that they remain consistent. Indeed, several fault-tolerant agreement protocols rely on an eventual leader election service. This problem has been initially studied in crash-prone systems, and more recently in other failure scenarios, e.g., cr...
متن کاملReplication Predicates for Dependent-Failure Algorithms
To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some property of interest. This violation leads to the conclusion that the lower bound on process replication is of the form n > bkt/bc, where t is the maximum number of process failures in any of these executions and k, b are positiv...
متن کاملA Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characterized by probabilistic failure rates of processes and message deliveries. The protocol trades correctness for scale, that is, it provides very good probabilistic guarantees on correct termination in the sense of the c...
متن کاملRobust Stabilizing Leader Election
In this paper, we mix two well-known approaches of the fault-tolerance: robustness and stabilization. Robustnessis the aptitude of an algorithm to withstand permanent failures such as process crashes. The stabilization is a generaltechnique to design algorithms tolerating transient failures. Using these two approaches, we propose algorithms thattolerate both transient and crash fail...
متن کاملLeader Election Algorithm in 3D Torus Networks with the Presence of One Link Failure
Leader election is the process of choosing a leader for symmetry breaking where each node in the network eventually decides whether it is a leader or not. This paper proposes a new leader election algorithm to solve the problem of leader failure in three dimensional torus networks. The proposed algorithm solves the election problem despite the existent of link failure. In a network of N nodes c...
متن کامل